Enhanced Initial Centroids for K-means Algorithm
نویسنده
چکیده
This paper focuses on the enhanced initial centroids for the K-means algorithm. The original kmeans is using the random choice of init ial seeds which is a major limitation of the orig inal K-means algorithm because it produces less reliab le result of clustering the data. The enhanced method of the k-means algorithm includes the computation of the weighted mean to improve the centroids initializat ion. This paper shows the comparison between K-Means and the enhanced KMeans algorithm, and it proves that the new method of selecting initial seeds is better in terms of mathemat ical computation and reliability.
منابع مشابه
Selection of Initial Centroids for k-Means Algorithm
Clustering is one of the important data mining techniques. k-Means [1] is one of the most important algorithm for Clustering. Traditional k-Means algorithm selects initial centroids randomly and in k-Means algorithm result of clustering highly depends on selection of initial centroids. k-Means algorithm is sensitive to initial centroids so proper selection of initial centroids is necessary. Thi...
متن کاملAn Effective and Efficient Algorithm for Document Clustering
This paper proposes an effective and efficient algorithm for clustering text documents. This algorithm is formulated by using the concept of well known k-means algorithm. The standard k-means algorithm suffers from the problem of random initialization of initial cluster centers. The proposed algorithm eliminates this problem by introducing a new approach for selection of initial cluster centroi...
متن کاملIdentify High-Quality Protein Structural Models by Enhanced K-Means
Background. One critical issue in protein three-dimensional structure prediction using either ab initio or comparative modeling involves identification of high-quality protein structural models from generated decoys. Currently, clustering algorithms are widely used to identify near-native models; however, their performance is dependent upon different conformational decoys, and, for some algorit...
متن کاملGraph based Text Document Clustering by Detecting Initial Centroids for k-Means
Document clustering is used in information retrieval to organize a large collection of text documents into some meaningful clusters. k-means clustering algorithm of pratitional category, performs well on document clustering. k-means organizes a large collection of items into k clusters so that a criterion function is optimized. As it is sensitive to the initial values of cluster centroids, this...
متن کاملEfficient and Fast Initialization Algorithm for K- means Clustering
The famous K-means clustering algorithm is sensitive to the selection of the initial centroids and may converge to a local minimum of the criterion function value. A new algorithm for initialization of the K-means clustering algorithm is presented. The proposed initial starting centroids procedure allows the K-means algorithm to converge to a “better” local minimum. Our algorithm shows that ref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016